Convergent Term Rewriting Systems for Inverse Computation of Injective Functions

نویسندگان

Naoki Nishida

Masahiko Sakai

Terutoshi Kato

چکیده

This paper shows a sufficient syntactic condition for constructor TRSs whose inverse-computation CTRSs generated by Nishida, Sakai and Sakabe’s inversion compiler are confluent and operationally terminating. By replacing the unraveling at the second phase of the compiler with Serbanuta and Rosu’s transformation, we generate convergent TRSs for inverse computation of injective functions satisfying the sufficient condition.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving Injectivity of Functions via Program Inversion in Term Rewriting

Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient conditions for injectivity of functions in term rewriting, which are based on program inversion. More precisely, we show that functions defined by non-erasing, convergent and sufficiently complete constructor rewrite s...

متن کامل

Completion after Program Inversion of Injective Functions

Given a constructor term rewriting system that defines injective functions, the inversion compiler proposed by Nishida, Sakai and Sakabe generates a conditional term rewriting system that defines the inverse relations of the injective functions, and then the compiler unravels the conditional system into an unconditional term rewriting system. In general, the resulting unconditional system is no...

متن کامل

Completion of Unraveled Term Rewriting Systems toward Program Inversion of Injective Functions

Given a constructor term rewriting system defining injective functions, the inversion compiler proposed by Nishida, Sakai and Sakabe generates a confluent conditional term rewriting system, and unravels the conditional system into an unconditional term rewriting system. In general, the unconditional system is not confluent and thus not computationally equivalent to the conditional system. In th...

متن کامل

Reversible Term Rewriting

Essentially, in a reversible programming language, for each forward computation step from state S to state S′, there exists a constructive and deterministic method to go backwards from state S′ to state S. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional program transformation, or qu...

متن کامل